Reducibility index and sum-reducibility index
نویسندگان
چکیده
Let [Formula: see text] be a commutative Noetherian ring. For finitely generated text]-module text], Northcott introduced the reducibility index of which is number submodules appearing in an irredundant irreducible decomposition submodule text]. On other hand, for Artinian Macdonald proved that sum-irreducible representation does not depend on choice representation. This called sum-reducibility In former part this paper, we compute where flat homomorphism rings. Especially, localization, polynomial extension, and completion are studied. latter clarify relation among Matlis dual
منابع مشابه
The Index of Reducibility of Parameter Ideals in Low Dimension
In this paper we present results concerning the following question: If M is a finitely-generated module with finite local cohomologies over a Noetherian local ring (A,m), does there exist an integer l such that every parameter ideal for M contained in m has the same index of reducibility? We show that the answer is yes if dimM = 1 or if dimM = 2 and depthM > 0. This research is closely related ...
متن کاملRandomness and Reducibility
How random is a real? Given two reals, which is more random? If we partition reals into equivalence classes of reals of the “same degrees of randomness”, what does the resulting structure look like? The goal of this paper is to look at questions like these, specifically by studying the properties of reducibilities that act as measures of relative randomness, as embodied in the concept of initia...
متن کاملReducibility and Completeness
There is little doubt that the notion of reducibility is the most useful tool that complexity theory has delivered to the rest of the computer science community. For most computational problems that arise in real-world applications, such as the Traveling Salesperson Problem, we still know little about their deterministic time or space complexity. We cannot now tell whether classes such as P and...
متن کاملComputational Depth and Reducibility
This paper reviews and investigates Bennett s notions of strong and weak computational depth also called logical depth for in nite binary sequences Roughly an in nite binary sequence x is de ned to be weakly useful if every element of a non negligible set of decidable sequences is reducible to x in recursively bounded time It is shown that every weakly useful sequence is strongly deep This resu...
متن کاملRosenberg , Reducibility and Consciousness
Although original, intricate and sophisticated, Gregg Rosenberg’s core argument in favor of panpsychism is a version of an argument that has been around for some time. My paper tries to shed some light on Rosenberg's strategy by comparing it to the views of Leibniz (or a fictional philosopher close to him) who took a similar approach. At the heart of the argument is the idea that relational pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2021
ISSN: ['1793-6829', '0219-4988']
DOI: https://doi.org/10.1142/s0219498822501523